Graph Theory Notes ∗
نویسنده
چکیده
A graph G = (V,E) consists of two sets V and E. The elements of V are called the vertices and the elements of E the edges of G. Each edge is a pair of vertices. For instance, the sets V = {1, 2, 3, 4, 5} and E = {{1, 2}, {2, 3}, {3, 4}, {4, 5}} define a graph with 5 vertices and 4 edges. Graphs have natural visual representations in which each vertex is represented by a point and each edge by a line connecting two points.
منابع مشابه
Autobiographical notes
I was born in Zagreb (Croatia) on October 26, 1936. My parents were Regina (née Pavić) (April17, 1916, Zagreb–March 9, 1992, Zagreb) and Cvjetko Trinajstić (September 9, 1913, Volosko–October 29, 1998, Richmond, Australia).
متن کاملNotes on Extremal Graph Theory
What you see below are notes related to a course that I have given several times in Extremal Graph Theory. I guarantee no accuracy with respect to these notes and I certainly do not guarantee completeness or proper attribution. This is an early draft and, with any luck and copious funding, some of this can be made into a publishable work and some will just remain as notes. Please do not distrib...
متن کاملDominator Coloring of Central Graphs
J. A. Bondy and U. S. R. Murty, Graph theory with Applications, London: MacMillan (1976). R. M. Gera, On Dominator Colorings in Graphs, Graph Theory Notes of New York LIT, 25-30 (2007) F. Harary, Graph Theory, Narosa Publishing 1969. D. Michalak, On Middle and Total graphs with Coarseness Number Equal 1, Lecture Notes in Mathematics, Volume 1018: Graph Theory, Springer-Verlag, Berlin, 139 – 150...
متن کاملNotes on NP Completeness
Here are some notes which I wrote to try to understand what NP completeness means. Most of these notes are taken from Appendix B in Douglas West’s graph theory book, and also from wikipedia. There’s nothing remotely original about these notes. I just wanted all this material to filter through my brain and onto paper. I also wanted to collect everything together in a way I like. Here’s what thes...
متن کاملLecture Notes on Expansion, Sparsest Cut, and Spectral Graph Theory
Foreword These notes are a lightly edited revision of notes written for the course " Graph Partitioning and Expanders " offered at Stanford in Winter 2011 and Winter 2013. I wish to thank the students who attended this course for their enthusiasm and hard work. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author and do not necessarily re...
متن کامل